FPGA-based Normalization for Modified Gram-Schmidt Orthogonalization

نویسندگان

  • Imtiaz Sajid
  • Sotirios G. Ziavras
  • M. M. Ahmed
چکیده

Eigen values evaluation is an integral but computation-intensive part for many image and signal processing applications. Modified Gram-Schmidt Orthogonalization (MGSO) is an efficient method for evaluating the Eigen values in face recognition algorithms. MGSO applies normalization of vectors in its iterative orthogonal process and its accuracy depends on the accuracy of normalization. Using software, floatingpoint data types and floating-point operations are applied to minimize rounding and truncation effects. Hardware support for floating-point operations may be very costly in execution time per operation and also may increase power consumption. In contrast, lower-cost fixed-point arithmetic reduces execution times and lowers the power consumption but reduces slightly the precision. Normalization involves square root operations in addition to other arithmetic operations. Hardware realization of the floating-point square root operation may be prohibitively expensive because of its complexity. This paper presents three architectures, namely ppc405, ppc_ip and pc_pci, that employ fixed-point hardware for the efficient implementation of normalization on an FPGA. We evaluate the suitability of these architectures based on the needed frequency of normalization. The proposed architectures produce a less than 10 error rate compared with their software-driven counterpart for implementing floating-point operations. Furthermore, four popular databases of faces are used to benchmark the proposed architectures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new adaptive GMRES algorithm for achieving high accuracy

GMRES(k) is widely used for solving nonsymmetric linear systems. However, it is inadequate either when it converges only for k close to the problem size or when numerical error in the modified Gram–Schmidt process used in the GMRES orthogonalization phase dramatically affects the algorithm performance. An adaptive version of GMRES(k) which tunes the restart value k based on criteria estimating ...

متن کامل

Another Proof for Modified Gram-schmidt with Reorthogonalization

In this note, we consider the modified Gram-Schmidt algorithm with reorthogonalization applied on a numerical nonsingular matrix, we explain why the resulting set of vectors is orthogonal up to the machine precision level. To establish this result, we show that a certain L-criterion is necessarily verified after the second reorthogonalization step, then we prove that this L-criterion implies th...

متن کامل

When Modified Gram-schmidt Generates a Well-conditioned Set of Vectors

Orthogonalization methods play a key role in many iterative methods. In this paper, we establish new properties for the modified Gram-Schmidt algorithm. We show why the modified Gram-Schmidt algorithm generates a well-conditioned set of vectors. This result holds under the assumption that the initial matrix is not “too ill-conditioned” in a way that is quantified. As a consequence we show that ...

متن کامل

Stability Analysis and Improvement of the Block Gram-Schmidt Algorithm

The advent of supercomputers with hierarchical memory systems has imposed the use of block algorithms for the linear algebra algorithms. Although block algorithms may result in impressive improvements in performance, their numerical properties are quite different from their scalar counterpart and deserve an in-depth study. In this paper, the numerical stability ofblock Gram-Schmidt orthogonaliz...

متن کامل

A New Approach for Solving Volterra Integral Equations Using The Reproducing Kernel ‎Method

This paper is concerned with a technique for solving Volterra integral equations in the reproducing kernel Hilbert space. In contrast with the conventional reproducing kernel method, the Gram-Schmidt process is omitted here and satisfactory results are obtained.The analytical solution is represented in the form of series.An iterative method is given to obtain the approximate solution.The conver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010